Proof theory - PDFSEARCH.IO - Document Search Engine

Proof theory
Results: 1637

#	Item
581	Automated Deduction in the B Set Theory using Deduction Modulo? Guillaume Bury1 , David Delahaye1 , Damien Doligez2 , Pierre Halmagrand1 , and Olivier Hermant3 1 Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2015-03-03 08:27:10 Symbol Admissible rule Proof theory First-order logic Entailment Constructible universe Curry–Howard correspondence Orbifold Logic Mathematical logic Deduction
582	[hal, v2] Polarizing Double Negation Translations Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2014-01-28 10:15:20 Sequent calculus Sequent Entailment Intuitionistic logic Gödel–Gentzen negative translation Natural deduction Curry–Howard correspondence Logic Mathematical logic Proof theory
583	The Spirit of Ghost Code Jean-Christophe Filliˆ atre1,2 , L´eon Gondelman1? , and Andrei Paskevich1,2 1 Lab. de Recherche en Informatique, Univ. Paris-Sud, CNRS, Orsay, F-91405 Add to Reading List Source URL: bware.lri.fr Language: English - Date: 2014-09-27 10:51:46 Character encoding Digital typography Symbol Mathematics Orbifold Proof theory Programming language semantics Logic in computer science
584	Double Negation Translations as Morphisms Olivier Hermant CRI, MINES ParisTech December 12, 2014 Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2014-12-23 09:42:55 Proof theory Logic in computer science Propositional calculus Mathematical constructivism Intuitionistic logic Non-classical logic Sequent calculus Negation Natural deduction Mathematical logic Logic Mathematics
585	How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-01 02:12:54 Computational complexity theory Interactive proof system NEXPTIME Probabilistically checkable proof IP Cryptographic protocols Soundness NP Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes
586	Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-09-15 12:03:01 Computational complexity theory IP Proof of knowledge Zero-knowledge proof NP Probabilistically checkable proof Soundness Formal verification Snark Theoretical computer science Applied mathematics Cryptographic protocols
587	[hal, v1] Proof Certi?cation in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2014-01-28 10:11:41 Logical syntax Logic in computer science Proof theory Mathematical logic Mathematical proof Theorem Formal proof Automated reasoning Logic Mathematics Automated theorem proving
588	Notre Dame Journal of Formal Logic A Simple Proof That Super-Consistency Implies Cut Elimination Gilles Dowek and Olivier Hermant Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2013-02-21 08:17:51 Mathematical logic Proof theory Natural deduction Entailment Function Curry–Howard correspondence Orbifold Logic Mathematics Deduction
589	[hal, v1] Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2014-01-28 10:05:43 Logic in computer science Unification First-order logic Combinatory logic Rewriting Model theory Axiom Mathematical proof Peano axioms Logic Mathematics Mathematical logic
590	Double Negation Translations as Morphisms Olivier Hermant CRI, MINES ParisTech December 1, 2014 Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2014-12-23 09:45:32 Proof theory Logic in computer science Propositional calculus Mathematical constructivism Intuitionistic logic Non-classical logic Sequent calculus Negation Natural deduction Mathematical logic Logic Mathematics

UPDATE